recursive subroutine

recursive subprogram or recursive subroutine noun (computing)
One which includes among its program statements a call to the subprogram itself
• • •
Main Entry:recur

Useful english dictionary. 2012.

Look at other dictionaries:

  • recursive subprogram — or recursive subroutine noun (computing) One which includes among its program statements a call to the subprogram itself • • • Main Entry: ↑recur …   Useful english dictionary

  • Subroutine — In computer science, a subroutine (function, method, procedure, or subprogram) is a portion of code within a larger program, which performs a specific task and can be relatively independent of the remaining code. The syntax of many programming… …   Wikipedia

  • Recursive function — may refer to: Recursion (computer science), a procedure or subroutine, implemented in a programming language, whose implementation references itself A total computable function, a function which is defined for all possible inputs See also μ… …   Wikipedia

  • recursive routine — noun a routine that can call itself • Hypernyms: ↑routine, ↑subroutine, ↑subprogram, ↑procedure, ↑function …   Useful english dictionary

  • Non-recursive function — might refer to: Recursion (computer science): a procedure or subroutine, implemented in a programming language, whose implementation references itself μ recursive function, defined from a particular formal model of computable functions using… …   Wikipedia

  • Non-structured programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

  • Алгоритм Штрассена — предназначен для быстрого умножения матриц. Он был разработан Штрассеном в 1969 году как обобщение метода умножения Карацубы на матрицы. В отличие от традиционного алгоритма умножения матриц (по формуле cik = Σaijbjk), работающего за время Θ(n³) …   Википедия

  • Cache-oblivious algorithm — In computing, a cache oblivious algorithm is an algorithm designed to exploit the CPU cache without having the size of the cache (or the length of the cache lines, etcetera) as an explicit parameter. An optimal cache oblivious algorithm is a… …   Wikipedia

  • META II — is a compiler writing language (also known as compiler compiler) first released in 1962 by D. V. Schorre. It consists of syntax equations resembling Backus normal form and into which instructions to output assembly language commands are inserted …   Wikipedia

  • рекурсивная подпрограмма — Подпрограмма, которая может обращаться к себе самой. [ГОСТ 19781 90] Тематики обеспеч. систем обраб. информ. программное EN recursive subroutine …   Справочник технического переводчика

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.